7 research outputs found

    Best monotone degree conditions for binding number

    Get PDF
    AbstractWe give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b>0. Our conditions are best possible in exactly the same way that Chvátal’s well-known degree condition to guarantee a graph is Hamiltonian is best possible

    A Survey of Best Monotone Degree Conditions for Graph Properties

    Full text link
    We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is best possible.Comment: 25 page

    Best monotone degree conditions for graph properties: a survey

    Get PDF
    We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvátal’s well-known degree condition for hamiltonicity is best possible
    corecore